منابع مشابه
Volume-preserving Pl-maps between Polyhedra
We prove that for every two convex polytopes P, Q ∈ R with vol(P ) = vol(Q), there exists a continuous piecewise-linear (PL) volume-preserving map f : P → Q. The result extends to general PL-manifolds. The proof is inexplicit and uses the corresponding fact in the smooth category, proved by Moser in [Mo]. We conclude with various examples and combinatorial applications.
متن کاملTransverse Cellular Mappings of Polyhedra
We generalize Marshall Cohen's notion of transverse cellular map to the polyhedral category. They are described by the following: Proposition. Let f : K —* L be a proper simplicial map of locally finite simplicial complexes. The following are equivalent: (1) The dual cells of the map are all cones. (2) The dual cells of the map are homogeneously collapsible in K. (3) The inclusion of L into the...
متن کاملDetecting intersections between convex polyhedra
For a polyhedron P in R, denote by |P | its combinatorial complexity, i.e., the number of faces, edges and vertices of the polyhedra. In this paper, we revisit the classic problem of preprocessing polyhedra independently so that given two preprocessed polyhedra P and Q in R, each translated and rotated, their intersection can be tested rapidly. For d = 3 we show how to perform such a test in O(...
متن کاملScrambled Sets of Continuous Maps of 1-dimensional Polyhedra
Let K be a 1-dimensional simplicial complex in R3 without isolated vertexes, X = |K| be the polyhedron of K with the metric dK induced by K, and f : X → X be a continuous map. In this paper we prove that if K is finite, then the interior of every scrambled set of f in X is empty. We also show that if K is an infinite complex, then there exist continuous maps from X to itself having scrambled se...
متن کاملBar-Magnet Polyhedra and NS-Orientations of Maps
At the CCCG 2001 open-problem session [2], J. O’Rourke asked which polyhedra can be represented by bars and magnets. This problem can be phrased as follows: which 3-connected planar graphs may have their edges directed so that the directions “alternate” around each vertex (with one exception of non-alternation if the degree is odd). In this note we solve O’Rourke’s problem and generalize it to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1982
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1982-0662050-3